Propositional formula - PDFSEARCH.IO - Document Search Engine

Propositional formula
Results: 133

#	Item
71	Verifying time, memory and communication bounds in systems of reasoning agents Natasha Alechina, Brian Logan, Nguyen Hoang Nga and Abdur Rakib∗ School of Computer Science University of Nottingham Nottingham NG8 1BB, UK Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-04-08 05:17:39 Deduction Propositional calculus Mathematical logic Artificial intelligence Logical syntax Epistemic modal logic Reasoning system Entailment Formula Logic Science Mathematics
72	Bounded-Resource Reasoning as (Strong or Classical) Planning A. Albore1 , N. Alechina2 , P. Bertoli3 , C. Ghidini3 , and B. Logan2 Universitat Pompeu Fabra, pg.Circumval·laci´o[removed], Barcelona, Spain School of Compu Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-09-21 08:27:09 Formal languages Propositional calculus Logical syntax Logic in computer science Well-formed formula Natural deduction Method of analytic tableaux Function Formula Logic Mathematics Mathematical logic
73	Model-checking space and time requirements for resource-bounded agents Natasha Alechina1 , Piergiorgio Bertoli2 , Chiara Ghidini2 , Mark Jago1 , Brian Logan1, and Luciano Serafini2 1 Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2006-08-16 14:39:00 Formal languages Model theory Logical truth Propositional calculus Logical syntax Substitution Formula Well-formed formula Interpretation Logic Mathematics Mathematical logic
74	Model-checking space and time requirements for resource-bounded agents Natasha Alechina1 , Piergiorgio Bertoli2 , Chiara Ghidini2 , Mark Jago1 , Brian Logan1, and Luciano Serafini2 1 Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-09-11 12:40:28 Formal languages Model theory Logical truth Propositional calculus Logical syntax Substitution Formula Well-formed formula Interpretation Logic Mathematics Mathematical logic
75	Logical Omniscience and the Cost of Deliberation Natasha Alechina and Brian Logan School of Computer Science and IT, University of Nottingham, Nottingham NG8 1BB, UK, Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-09-11 12:40:28 Mathematical logic Metalogic Formal languages Entailment Well-formed formula Modal logic Function Constructible universe Model theory Logic Logical syntax Propositional calculus
76	Verifying time, memory and communication bounds in systems of reasoning agents Natasha Alechina, Brian Logan, Nguyen Hoang Nga and Abdur Rakib∗ School of Computer Science University of Nottingham Nottingham NG8 1BB, UK Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-09-11 12:40:28 Deduction Propositional calculus Mathematical logic Artificial intelligence Logical syntax Epistemic modal logic Reasoning system Entailment Formula Logic Science Mathematics
77	The PMA and Relativizing Change for Action Update Patrick Doherty Dept. of Computer Science Linkoping University S[removed]Linkoping, Sweden Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-03 06:08:21 Boolean algebra Propositional calculus Modal logic Philosophical logic Consistency Well-formed formula Mereology Logic Mathematical logic Non-classical logic
78	Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas Patrick Doherty Dept. of Computer Science Link¨oping University S[removed]Link¨oping, Sweden Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-01 08:08:21 Propositional calculus Model theory Boolean algebra Formal languages Predicate logic Propositional variable First-order logic Interpretation Propositional formula Logic Mathematical logic Mathematics
79	Synthesizing Safe Bit-Precise Invariants? Arie Gurfinkel, Anton Belov and Joao Marques-Silva Abstract. Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in Add to Reading List Source URL: anton.belov-mcdowell.com Language: English - Date: 2014-01-27 10:25:19 Propositional calculus Boolean algebra Electronic design automation Logic in computer science NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories Well-formed formula Unsatisfiable core Logic Theoretical computer science Mathematical logic
80	A Technique for Analyzing the Effects of Changes in Formal Specifications Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2014-12-18 20:03:24 Predicate logic Propositional calculus Semantics Model theory First-order logic Cross-linked polyethylene Function Predicate Propositional formula Logic Mathematical logic Mathematics

UPDATE